Classically optimized Hamiltonian simulation
نویسندگان
چکیده
Hamiltonian simulation is a promising application for quantum computers to achieve advantage. We present classical algorithms based on tensor network methods optimize circuits this task. show that, compared Trotter product formulas, the classically optimized can be orders of magnitude more accurate and significantly extend total time.
منابع مشابه
Optimized Impulse-Based Dynamic Simulation
The impulse-based dynamic simulation is a recent method to compute physically based simulations. It supports the simulation of rigid-bodies and particles connected by all kinds of implicit constraints. In recent years the impulse-based dynamic simulation has been more and more used to simulate deformable bodies as well. These simulations create new requirements for the runtime of the method bec...
متن کاملCascade Simulation On Optimized Networks
Cascade phenomena, which are sequences of adoption by agents, are the important driven forces for the society to make a successful diffusion of innovation. Cascade phenomena on complex networks occur under a range of conditions (or known as cascade windows) defined by both the average degree of the underlying network topology and the threshold of each agents(or nodes). In this paper, we obtain ...
متن کاملOptimized Statistical Analog Fault Simulation
A new statistical method for analog fault simulation is presented. The method takes into account process parameter variations and aims to reduce the number of the computational expensive Monte Carlo simulations often required during analog fault simulation. The technique is illustrated by means of a fifth-order low-pass switched-capacitor filter.
متن کاملClassically Projective Groups and Pseudo Classically Closed Elds
The present variant is almost identical with the one from 1990. The main change is a correction in proof of Lemma 2.4, which was pointed out to me by Matthias Flach. I would also like to give my special thanks to P. Roquette and A. Prestel for several discussions we have had on this subject since the publication of the preprint. Finally, I would like to thank various people who showed interest ...
متن کاملBlack-box hamiltonian simulation and unitary implementation
We present general methods for simulating black-box Hamiltonians using quantum walks. These techniques have two main applications: simulating sparse Hamiltonians and implementing black-box unitary operations. In particular, we give the best known simulation of sparse Hamiltonians with constant precision. Our method has complexity linear in both the sparseness D (the maximum number of nonzero el...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical review research
سال: 2023
ISSN: ['2643-1564']
DOI: https://doi.org/10.1103/physrevresearch.5.023146